翻訳と辞書 Words near each other ・ Aperadi ・ Aperahama Tama-i-parea ・ Aperahama Taonui ・ Aperam ・ Aperam South America ・ Aperanat ・ Aperantia ・ Apere River ・ Aperel ・ Aperfield ・ Apergy ・ Aperibeense Futebol Clube ・ Aperibé ・ Apericallia ・ Aperiodic (disambiguation) ・ Aperiodic finite state automaton ・ Aperiodic frequency ・ Aperiodic graph ・ Aperiodic semigroup ・ Aperiodic set of prototiles ・ Aperiodic tiling ・ Aperioptus ・ Aperiovula ・ Aperiovula adriatica ・ Aperiovula juanjosensii ・ Aperitif for Destruction ・ Aperlae ・ Aperol ・ Aperol Spritz ・ Aperregui Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Aperiodic finite state automaton ： ウィキペディア英語版 Aperiodic finite state automaton An aperiodic finite-state automaton is a finite-state automaton whose transition monoid is aperiodic. ==Properties== A regular language is star-free if and only if it is accepted by an automaton with a finite and aperiodic transition monoid. This result of algebraic automata theory is due to Marcel-Paul Schützenberger. A counter-free language is a regular language for which there is an integer ''n'' such that for all words ''x'', ''y'', ''z'' and integers ''m'' ≥ ''n'' we have ''xy''''m''''z'' in ''L'' if and only if ''xy''''n''''z'' in ''L''. A counter-free automaton is a finite-state automaton which accepts a counter-free language. A finite-state automaton is counter-free if and only if it is aperiodic. An aperiodic automaton satisfies the Černý conjecture. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Aperiodic finite state automaton」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.